Preemptive Task Execution and Scheduling of Parallel Programs in Message-Passing Systems
نویسندگان
چکیده
The scheduling of tasks within a parallel program onto the underlying available processors has been studied for some time. To date, solutions to this problem generally assume that communication only occurs at the start or end of each parallel task, i.e., the child task can only start its execution when all its parent tasks complete and have sent data to it. This is termed \non-preemptive task scheduling". This paper examines the problem of the preemptive parallel program which is represented by a preemptive task model. A new preemptive scheduling algorithm, named PET, is also proposed. Experiments are conducted to illustrate the performance achievable through preemptive task execution and scheduling.
منابع مشابه
Supporting Application Integrated Load Distribution for Message Passing Programs
Message passing libraries for parallel programming like PVM [SGDM94] and the emerging MPI standard [Wal94] are more and more used as programming environments for parallel applications in workstation clusters or distributed memory supercomputers. Simple usage of the programming environment, flexibility of the programming model, and efficiency of implementations are main aspects of the ongoing di...
متن کاملExploiting duplication to minimize the execution times of parallel programs on message-passing systems
Communication overhead is one of the main factors that can limit the speedup of parallel programs on message-passing parallel architectures. This limiting factor is more predominant in distributed systems such as clusters of homogeneous or heterogeneous workstations. However, excessive communication overhead can be reduced by redundantly executing some of the tasks of a parallel program on whic...
متن کاملOpen Problems on Non-preemptive Scheduling of Mixed-Criticality Real-Time Systems
In many industrial systems, design complexity is partly reduced by the use of non-preemptive message passing or execution. Doing so, context switch overheads are diminished and resource sharing mechanisms are simplified. However, in a mixedcriticality system, long blocking time caused by non-preemptive execution of a task which has lower priority than some other high criticality (HC) tasks migh...
متن کاملScheduling Preemptive Tasks in Parallel and Distributed Systems
Algorithms for the scheduling of tasks within a parallel program onto available processors generally assume that communication only occurs at the start or end of each task, i.e., a task can only commence execution when all necessary data has been sent to it. This is termed \non-preemptive task scheduling". This paper examines the problem of the preemptive parallel program which is represented b...
متن کاملA Comparison of Task-Duplication-Based Algorithms for Scheduling Parallel Programs to Message-Passing Systems†
A major hurdle in achieving high performance in message-passing architectures is the inevitable communication overhead that occurs when tasks scheduled on different processors need to exchange data. This overhead can cause a stern penalty especially in distributed systems such as clusters of workstations, where the network channels are considerably slower than the processors. For a given parall...
متن کامل